Fast hierarchical low-rank view factor matrices for thermal irradiance on planetary surfaces
نویسندگان
چکیده
We present an algorithm for compressing the radiosity view factor model commonly used in radiation heat transfer and computer graphics. use a format inspired by hierarchical off-diagonal low rank format, where elements are recursively partitioned using quadtree or octree blocks compressed sparse singular value decomposition—the matrix is assembled dynamic programming. The motivating application time-dependent thermal modeling on vast planetary surfaces, with focus permanently shadowed craters which receive energy through indirect irradiance. In this setting, shape models comprised of large number triangular facets conform to rough surface. At each time step, quadratic triangle-to-triangle scattered fluxes must be summed; that is, as sun moves sky, we solve same system equations potentially unlimited time-varying righthand sides. first conduct numerical experiments synthetic spherical cap-shaped crater, equilibrium temperature analytically available. also test our implementation triangle meshes surfaces derived from digital elevation recovered orbiting spacecrafts. Our results indicate can time, comparable it takes assemble full itself. Memory requirements during assembly reduced factor. Finally, range compression tolerances, size speed resulting vector product both scale linearly (as opposed quadratically matrix), orders magnitude savings processing memory space.
منابع مشابه
Matrices with hierarchical low-rank structures
Matrices with low-rank off-diagonal blocks are a versatile tool to perform matrix compression and to speed up various matrix operations, such as the solution of linear systems. Often, the underlying block partitioning is described by a hierarchical partitioning of the row and column indices, thus giving rise to hierarchical low-rank structures. The goal of this chapter is to provide a brief int...
متن کاملFast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
Inversion of sparse matrices with standard direct solve schemes is robust, but computationally expensive. Iterative solvers, on the other hand, demonstrate better scalability, but need to be used with an appropriate preconditioner (e.g., ILU, AMG, Gauss-Seidel, etc.) for proper convergence. The choice of an effective preconditioner is highly problem dependent. We propose a novel fully algebraic...
متن کاملA Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices
Singular value decomposition (SVD) is a widely used technique for dimensionality reduction and computation of basis vectors. In many applications, especially in fluid mechanics, the matrices are dense, but low-rank matrices. In these cases, a truncated SVD corresponding to the most significant singular values is sufficient. In this paper, we propose a tree based merge-and-truncate algorithm to ...
متن کاملA Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact factorized representation without the need of specifying the rank beforehand. Moreover, we show that the framework can be easily generalized to the problem of learning multiple matrices and general spectral regularization...
متن کاملFast low rank approximations of matrices and tensors
In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given m × n matrix A by a matrix B of rank at most k which is much smaller than m and n. The best rank k approximation can be determined via the singular value decomposition which, however, has prohibitively high computational complexity and storage requirements for very large m and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal Of Computational Physics: X
سال: 2023
ISSN: ['2590-0552']
DOI: https://doi.org/10.1016/j.jcpx.2023.100130